Compilation efficace d'une classe de langages sans affectations = Efficient compilation of a languages classe without affectationsHOOGVORST, Philippe.1983, 206 pThesis

One-way multihead finite automata are not closed under concatenationDURIS, P; HROMKOVIC, J.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 121-125, issn 0304-3975Article

On real time and linear time cellular automataBUCHER, W; CULIK, K. II.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 307-325, issn 0399-0540Article

A homomorphic characterization of recursively enumerable languagesHIROSE, S; OKAWA, S; YONEDA, M et al.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 261-269, issn 0304-3975Article

CPO models for compact GSOS languagesACETO, L; INGOLFSDOTTIR, A.Information and computation (Print). 1996, Vol 129, Num 2, pp 107-141, issn 0890-5401Article

A combinational property of EOL languagesEHRENFEUCHT, A; ROZENBERG, G; VERRAEDT, R et al.Mathematical systems theory. 1985, Vol 18, Num 3, pp 207-235, issn 0025-5661Article

On subword complexity functionsSAJO, A.Discrete applied mathematics. 1984, Vol 8, Num 2, pp 209-212, issn 0166-218XArticle

On the correspondence between two classes of reduction systemsTHATTE, S. R.Information processing letters. 1985, Vol 20, Num 2, pp 83-85, issn 0020-0190Article

On restricting the size of oracles compared with restricting access to oraclesLONG, T. J.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 585-597, issn 0097-5397Article

Subset languages of Petri nets. II: Closure propertiesROZENBERG, G; VERRAEDT, R.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 85-108, issn 0304-3975Article

Elementary formal systems, intrinsic complexity, and procrastinationJAIN, S; SHARMA, A.Information and computation (Print). 1997, Vol 132, Num 1, pp 65-84, issn 0890-5401Article

Apprenabilité de Classes de Concepts Structurés = On the Learnability of Structural Concept ClassesJappy, Pascal; Gascuel, Olivier.1997, 114 p.Thesis

A fixed point characterization of cofinite languagesSemigroup forum. 1984, Vol 29, Num 3, pp 378-380, issn 0037-1912Article

Extended macro grammars and stack controlled machinesENGELFRIET, J; SLUTZKI, G.Journal of computer and system sciences (Print). 1984, Vol 29, Num 3, pp 366-408, issn 0022-0000Article

Algebraic characterisations of NTIME(F) and NTIME(F, A)STENGER, H.-J.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 365-385, issn 0399-0540Article

Characterizations of reduction classes modulo oracle conditionsBOOK, R. V; SELMAN, A. L.Mathematical systems theory. 1984, Vol 17, Num 4, pp 263-277, issn 0025-5661Article

Nested set languages for functional databasesORMAN, L.Information systems (Oxford). 1984, Vol 9, Num 3-4, pp 241-249, issn 0306-4379Article

On classes of tractable unrestricted regular expressionsLEISS, E.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 313-327, issn 0304-3975Article

On the complexity of iterated shuffleWARMUTH, M. K; HAUSSLER, D.Journal of computer and system sciences (Print). 1984, Vol 28, Num 3, pp 345-358, issn 0022-0000Article

Shuffle grammarsARAKI, T; TOKURA, N; KOSAI, S et al.Systems, computers, controls. 1983, Vol 14, Num 4, pp 37-45, issn 0096-8765Article

Compactness and learning of classes of unions of erasing regular pattern languagesUEMURA, Jin; SATO, Masako.Lecture notes in computer science. 2002, pp 293-307, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

On the Chomsky and Stanleýs homomorphic characterization of context-free languagesHIROSE, S; YONEDA, M.Theoretical computer science. 1985, Vol 36, Num 1, pp 109-112, issn 0304-3975Article

The recursion-theoretic structure of complexity classesSCHMIDT, D.Theoretical computer science. 1985, Vol 38, Num 2-3, pp 143-156, issn 0304-3975Article

Probabilistic turing machines and recursively enumerable dedekind cutsCHROBAK, M; CHLEBUS, B. S.Information processing letters. 1984, Vol 19, Num 4, pp 167-171, issn 0020-0190Article

Inferring unions of the pattern languages by the most fitting coversYEN KAOW NG; SHINOHARA, Takeshi.Lecture notes in computer science. 2005, pp 269-282, issn 0302-9743, isbn 3-540-29242-X, 1Vol, 14 p.Conference Paper